Testing Finitary Probabilistic Processes: DRAFT
نویسندگان
چکیده
This paper provides modaland relational characterisations of mayand must-testing preorders for recursive CSP processes with divergence, featuring probabilistic as well as nondeterministic choice. May testing is characterised in terms of simulation, and must testing in terms of failure simulation. To this end we develop weak transitions between probabilistic processes, elaborate their topological properties, and capture divergence in terms of partial distributions.
منابع مشابه
Testing Finitary Probabilistic Processes
We provide both modaland relational characterisations of mayand must-testing preorders for recursive CSP processes with divergence, featuring probabilistic as well as nondeterministic choice. May testing is characterised in terms of simulation, and must testing in terms of failure simulation. To this end we develop weak transitions between probabilistic processes, elaborate their topological pr...
متن کاملScalar Outcomes Suffice for Finitary Probabilistic Testing
The question of equivalence has long vexed research in concurrency, leading to many different denotationaland bisimulation-based approaches; a breakthrough occurred with the insight that tests expressed within the concurrent framework itself, based on a special “success action”, yield equivalences that make only inarguable distinctions. When probability was added, however, it seemed necessary t...
متن کاملThe complexity of model-checking of stateless probabilistic pushdown processes against PCTL
In this draft, we settle a problem in probabilistic verification of infinite–state processes (probabilistic pushdown systems). We show that model checking stateless probabilistic pushdown systems (pBPA) against probabilistic computational tree logic (PCTL) is undecidable.
متن کاملFair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of l...
متن کاملFair Termination for Parameterized Probabilistic Concurrent Systems
We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of l...
متن کامل